Acyclic Directed Graphs to Represent Conditional Independence Models
نویسندگان
چکیده
In this paper we consider conditional independence models closed under graphoid properties. We investigate their representation by means of acyclic directed graphs (DAG). A new algorithm to build a DAG, given an ordering among random variables, is described and peculiarities and advantages of this approach are discussed. Finally, some properties ensuring the existence of perfect maps are provided. These conditions can be used to define a procedure able to find a perfect map for some classes of independence models.
منابع مشابه
Maximum likelihood fitting of acyclic directed mixed graphs to binary data
Acyclic directed mixed graphs, also known as semi-Markov models represent the conditional independence structure induced on an observed margin by a DAG model with latent variables. In this paper we present the first method for fitting these models to binary data using maximum likelihood estimation.
متن کاملA factorization criterion for acyclic directed mixed graphs
Acyclic directed mixed graphs, also known as semi-Markov models represent the conditional independence structure induced on an observed margin by a DAG model with latent variables. In this paper we present a factorization criterion for these models that is equivalent to the global Markov property given by (the natural extension of) dseparation.
متن کاملDirected cyclic graphs, conditional independence, and non-recursive linear structural equation models
Recursive linear structural equation models can be represented by directed acyclic graphs. When represented in this way, they satisfy the Markov Condition. Hence it is possible to use the graphical d-separation to determine what conditional independence relations are entailed by a given linear structural equation model. I prove in this paper that it is also possible to use the graphical d-separ...
متن کاملA note on nonsymmetric independence models
In probability and statistics graphs are used to describe conditional independence structures (or analogously dependence/association structures) among the variables. Actually, there are three main classic approaches based on undirected graphs [10], directed acyclic graphs [11], or chain graphs [12]. These graphical structures obey graphoid properties (i.e. symmetry, decomposition, weak union, c...
متن کاملA Transformational Characterization of Markov Equivalence for Directed Maximal Ancestral Graphs
The conditional independence relations present in a data set usually admit multiple causal explanations — typically represented by directed graphs — which are Markov equivalent in that they entail the same conditional independence relations among the observed variables. Markov equivalence between directed acyclic graphs (DAGs) has been characterized in various ways, each of which has been found...
متن کامل